#include "NodePriorityQueue.h"
#include <algorithm>

int NodePriorityQueue::Top()
{
	return m_Nodes.front();
}

void NodePriorityQueue::Pop()
{
	//std::pop_heap(m_Nodes.begin(), m_Nodes.end(), NodeOrder(*m_Costs));
	m_Nodes.pop_back();
}

void NodePriorityQueue::Push(int n)
{
	m_Nodes.push_back(n);
	//std::push_heap(m_Nodes.begin(), m_Nodes.end(), NodeOrder(*m_Costs));
}

bool NodePriorityQueue::IsEmpty()
{
	return m_Nodes.empty();
}